Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution

نویسندگان

  • Xiaoyu Zhang
  • Chandrajit L. Bajaj
  • Vijaya Ramachandran
چکیده

In this paper we describe a parallel and out-of-core view-dependent isocontour visualization algorithm that efficiently extracts and renders the visible portions of an isosurface from large datasets. The algorithm first creates an occlusion map using ray-casting and nearest neighbors. With the occlusion map constructed, the visible portion of the isosurface is extracted and rendered. All steps are in a single pass with minimal communication overhead. The overall workload is well balanced based among parallel processors using random data distribution. Volumetric data are statically partitioned onto the local disks of each processor and loaded only when necessary. This out-of-core feature allows it to handle scalably large datasets. We additionally demonstrate significant speedup of the view-dependent isocontour visualization on a commodity off-the-shelf PC cluster.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution

In this paper we describe a parallel and out-of-core view-dependent isocontour visualization algorithm that efficiently extracts and renders the visible portions of an isosurface from large datasets. The algorithm first creates an occlusion map using ray-casting and nearest neighbors. With the occlusion map constructed, the visible portion of the isosurface is extracted and rendered. All steps ...

متن کامل

Out-of-Core and Dynamic Programming for Data Distribution on a Volume Visualization Cluster

Ray directed volume-rendering algorithms are well suited for parallel implementation in a distributed cluster environment. For distributed ray casting, the scene must be partitioned between nodes for good load balancing, and a strict view-dependent priority order is required for image composition. In this paper, we define the load balanced network distribution (LBND) problem and map it to the N...

متن کامل

Dependency-Free Parallel Progressive Meshes

The constantly increasing complexity of polygonal models in interactive applications poses two major problems. First, the number of primitives that can be rendered at real-time frame rates is currently limited to a few million. Second, less than 45 million triangles – with vertices and normal – can be stored per gigabyte. While the rendering time can be reduced using level-of-detail (LOD) algor...

متن کامل

Advanced visualization and data distribution steering in an HPF parallelization environment

On distributed-memory systems, the quality of the data distribution has a crucial impact on the eeciency of the computation. Sophisticated visualization of large in-core and out-of-core data, and steering capabilities of the debugging system sig-niicantly reduce program development cycle, especially for irregular applications. In this paper we present an advanced system for visualization and st...

متن کامل

Parallel View-Dependent Out-of-Core Progressive Meshes

The complexity of polygonal models is growing faster than the ability of graphics hardware to render them in real-time. If a scene contains many models and textures, it is often also not possible to store the entire geometry in the graphics memory. A common way to deal with such models is to use multiple levels of detail (LODs), which represent a model at different complexity levels. With view-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002